Matroid Constrained Fair Allocation Problem
نویسندگان
چکیده
منابع مشابه
A game-theoretic model for capacity-constrained fair bandwidth allocation
Data stream providers face a hard decision to satisfy the requirements of their subscribers. Each user has a minimum and a maximum required bandwidth. The server should be able to decide which requests can be satisfi ed and how much bandwidth will be allocated to each. We present a theoretical framework in a distributed mechanism for fair bandwidth allocation on a network with various bottlenec...
متن کاملOn ($1$, $ε$)-Restricted Max-Min Fair Allocation Problem
We study the max-min fair allocation problem in which a set of m indivisible items are to be distributed among n agents such that the minimum utility among all agents is maximized. In the restricted setting, the utility of each item j on agent i is either 0 or some non-negative weight wj . For this setting, Asadpour et al. [2] showed that a certain configuration-LP can be used to estimate the o...
متن کاملThe Lazy Matroid Problem
This article introduces the lazy matroid problem, which captures the goal of saving time or money in certain task selection scenarios. We are given a budget B and a matroid M with weights on its elements. The problem consists in finding an independent set F of minimum weight. In addition, F is feasible if its augmentation with any new element x implies that either F + x exceeds B or F + x is de...
متن کاملFair allocation without trade
We consider the age-old problem of allocating items among different agents in a way that is efficient and fair. Two papers, by Dolev et al. and Ghodsi et al., have recently studied this problem in the context of computer systems. Both papers had similar models for agent preferences, but advocated different notions of fairness. We formalize both fairness notions in economic terms, extending them...
متن کاملOn the cardinality constrained matroid polytope
Given a combinatorial optimization problem Π and an increasing finite sequence c of natural numbers, we obtain a cardinality constrained version Πc of Π by permitting only those feasible solutions of Π whose cardinalities are members of c. We are interested in polyhedra associated with those problems, in particular in inequalities that cut off solutions of forbidden cardinality. Maurras [11] an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2019
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v33i01.33019921